All Farthest Neighbors in the Presence of Highways and Obstacles
نویسندگان
چکیده
We consider the problem of computing all farthest neighbors (and the diameter) of a given set of n points in the presence of highways and obstacles in the plane. When traveling on the plane, travelers may use highways for faster movement and must avoid all obstacles. We present an efficient solution to this problem based on knowledge from earlier research on shortest path computation. Our algorithms run in O(nm(logm + log n)) time using O(m + n) space, where the m is the combinatorial complexity of the environment consisting of highways and obstacles.
منابع مشابه
Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles
We propose an implicit representation for the farthest Voronoi Diagram of a set P of n points in the plane lying outside a set R of m disjoint axes-parallel rectangular obstacles. The distances are measured according to the L1 shortest path (geodesic) metric. In particular, we design a data structure of size O(N) in O(N log N) time that supports O(N logN)-time farthest point queries (where N = ...
متن کاملL_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems
In this paper, we investigate the L1 geodesic farthest neighbors in a simple polygon P , and address several fundamental problems related to farthest neighbors. Given a subset S ⊆ P , an L1 geodesic farthest neighbor of p ∈ P from S is one that maximizes the length of L1 shortest path from p in P . Our list of problems include: computing the diameter, radius, center, farthestneighbor Voronoi di...
متن کاملTheoretical Genealogy of Inner-city Highways and Analyzing Its Impacts on Surroundings
Urban highways, as one of the most important sectors of transportation, have always been one of the most challenging, both in terms of budget consumption and its spatial, social, economic and environmental impacts on the city. It has been urban elements. To this end, this study analyzes the impacts of inter-city highways, examines the theories of how to deal with this spatial element, as well a...
متن کاملApproximate Weighted Farthest Neighbors and Minimum Dilation Stars
We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our techniques with core-sets for approximate unweighted farthest neighbors, we show how to find (1+ ε)-approximate farthest neighbors in time O(logn) per query in D-dimensional Euclidean space for any constants D and ε. A...
متن کاملOn co-Farthest Points in Normed Linear Spaces
In this paper, we consider the concepts co-farthest points innormed linear spaces. At first, we define farthest points, farthest orthogonalityin normed linear spaces. Then we define co-farthest points, co-remotal sets,co-uniquely sets and co-farthest maps. We shall prove some theorems aboutco-farthest points, co-remotal sets. We obtain a necessary and coecient conditions...
متن کامل